Orthogonal pulse shape design via semidefinite programming

نویسندگان

  • Timothy N. Davidson
  • Zhi-Quan Luo
  • Kon Max Wong
چکیده

In digital communications, orthogonal pulse shapes are often used to represent message symbols for transmission through a channel. The design of such pulse shapes is formulated as a convex semidefinite programming problem, from which a globally optimal pulse shape can be efficiently found using interior point methods. The formulation is used to design filters which achieve the minimal bandwidth for a given filter length, and the minimal filter length for a given bandwidth. The effectiveness of the method is demonstrated by the design of waveforms with substantially improved performance over the ‘chip’ waveforms specified in recent standards for digital mobile telecommunications.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Design of orthogonal pulse shapes for communications via semidefinite programming

In digital communications, orthogonal pulse shapes are often used to represent message symbols for transmission through a channel. In this paper, the design of such pulse shapes is formulated as a convex semidefinite programming problem, from which a globally optimal pulse shape can be efficiently found. The formulation is used to design filters that achieve a) the minimal bandwidth for a given...

متن کامل

A Recurrent Neural Network Model for Solving Linear Semidefinite Programming

In this paper we solve a wide rang of Semidefinite Programming (SDP) Problem by using Recurrent Neural Networks (RNNs). SDP is an important numerical tool for analysis and synthesis in systems and control theory. First we reformulate the problem to a linear programming problem, second we reformulate it to a first order system of ordinary differential equations. Then a recurrent neural network...

متن کامل

D-optimal Design for Multivariate Polynomial Regression via the Christoffel Function and Semidefinite Relaxations

We present a new approach to the design of D-optimal experiments with multivariate polynomial regressions on compact semi-algebraic design spaces. We apply the moment-sum-of-squares hierarchy of semidefinite programming problems to solve numerically and approximately the optimal design problem. The geometry of the design is recovered with semidefinite programming duality theory and the Christof...

متن کامل

Sdp Approximation of the Half Delay and the Design of Hilbert Pairs

This paper presents a method for designing an orthogonal Hilbert pair of wavelets. The wavelets are generated each by an orthogonal (CQF) filter bank. The scaling filter defining the first filter bank and wavelet is given. The second filter is optimized using an exact semidefinite programming (SDP) description of a special H∞ error measure of the half-sample delay. The result of the SDP problem...

متن کامل

Least-squares orthogonalization using semidefinite programming

We consider the problem of constructing an optimal set of orthogonal vectors from a given set of vectors in a real Hilbert space. The vectors are chosen to minimize the sum of the squared norms of the errors between the constructed vectors and the given vectors. We show that the design of the optimal vectors, referred to as the least-squares (LS) orthogonal vectors, can be formulated as a semid...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999